Reducible properties of graphs
نویسندگان
چکیده
Let IL be the set of all hereditary and additive properties of graphs. For P1,P2 ∈ IL, the reducible property R = P1 ◦ P2 is defined as follows: G ∈ R if and only if there is a partition V (G) = V1 ∪ V2 of the vertex set of G such that 〈V1〉G ∈ P1 and 〈V2〉G ∈ P2. The aim of this paper is to investigate the structure of the reducible properties of graphs with emphasis on the uniqueness of the decomposition of a reducible property into irreducible ones.
منابع مشابه
Minimal reducible bounds for induced-hereditary properties
Let (M ;⊆) and (L ;⊆) be the lattices of additive induced-hereditary properties of graphs and additive hereditary properties of graphs, respectively. A property R∈Ma (∈ L) is called a minimal reducible bound for a property P∈Ma (∈ L) if in the interval (P;R) of the lattice M (L) there are only irreducible properties. The set of all minimal reducible bounds of a property P∈Ma in the lattice M we...
متن کاملOn the factorization of reducible properties of graphs into irreducible factors
A hereditary property R of graphs is said to be reducible if there exist hereditary properties P1,P2 such that G ∈ R if and only if the set of vertices of G can be partitioned into V (G) = V1 ∪ V2 so that 〈V1〉 ∈ P1 and 〈V2〉 ∈ P2. The problem of the factorization of reducible properties into irreducible factors is investigated.
متن کاملMinimal forbidden subgraphs of reducible graph properties
A property of graphs is any class of graphs closed under isomorphism. Let P1,P2, . . . ,Pn be properties of graphs. A graph G is (P1,P2, . . . ,Pn)-partitionable if the vertex set V (G) can be partitioned into n sets, {V1, V2, . . . , Vn}, such that for each i = 1, 2, . . . , n, the graph G[Vi] ∈ Pi. We write P1◦P2◦ · · · ◦Pn for the property of all graphs which have a (P1,P2, . . . ,Pn)-partit...
متن کاملMinimal reducible bounds for hom-properties of graphs
Let H be a fixed finite graph and let → H be a hom-property, i.e. the set of all graphs admitting a homomorphism into H . We extend the definition of → H to include certain infinite graphs H and then describe the minimal reducible bounds for → H in the lattice of additive hereditary properties and in the lattice of hereditary properties.
متن کاملGallai's innequality for critical graphs of reducible hereditary properties
In this paper Gallai’s inequality on the number of edges in critical graphs is generalized for reducible additive induced-hereditary properties of graphs in the following way. Let P1,P2, . . . ,Pk (k ≥ 2) be additive induced-hereditary properties, R = P1◦ P2◦ · · · ◦Pk and δ = ∑k i=1 δ(Pi). Suppose that G is an R-critical graph with n vertices and m edges. Then 2m ≥ δn + δ−2 δ2+2δ−2 n + 2δ δ2+2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 15 شماره
صفحات -
تاریخ انتشار 1995